On maximizing the average time at a goal
نویسندگان
چکیده
منابع مشابه
On Maximizing the Average Time at a Goal
In a decision process (gambling or dynamic programming problem) with finite state space and arbitrary decision sets (gambles or actions), there is always available a Markov strategy whieh uniformly (nearly) maximizes the average time spent at a goal. Jf the decision sets are closed. there is even a stationary strategy with the same property. Examples are given to show that approximations by dis...
متن کاملthe effects of multiple intelligences (focus on musical, visual, and linguistic) and direct instruction on learning grammar: a case on iranian efl students at elementary level
1.0 overview it seems that grammar plays a crucial role in the area of second and foreign language learning and widely has been acknowledged in grammar research. in other words, teaching grammar is an issue which has attracted much attention to itself, and a lot of teachers argue about the existence of grammar in language teaching and learning. this issue will remind us a famous sentence f...
On average polynomial time
One important reason to consider average case complexity is whether all or at least some signi cant part of NP can be solved e ciently on average for all reasonable distributions Let PP comp be the class of problems which are solvable in average polynomial time for every polynomial time computable input distribution Following the framework of Levin the above question can now be formulated as Is...
متن کاملOn Average Time Hierarchies
For a time-constructible function T we give an explicit language LT which can be recognized in time T (n). We prove that any Turing machine that recognizes LT requires time close to T (n) for most inputs, thus forming an average time hierarchy. The existence of the average time hierarchy was known, but depended on languages de ned by complicated diagonalization. We also give simple proofs for t...
متن کاملMaximizing the Conditional Expected Reward for Reaching the Goal
The paper addresses the problem of computing maximal conditional expected accumulated rewards until reaching a target state (briefly called maximal conditional expectations) in finite-state Markov decision processes where the condition is given as a reachability constraint. Conditional expectations of this type can, e.g., stand for the maximal expected termination time of probabilistic programs...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Stochastic Processes and their Applications
سال: 1984
ISSN: 0304-4149
DOI: 10.1016/0304-4149(84)90010-3